Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
نویسندگان
چکیده
منابع مشابه
Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G-vertex-transitive graph Γ. In the main result the group G is quasiprimitive or biquasiprimitive on the vertices of Γ, and we obtain a genuine reduction to the case where G is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general G-...
متن کاملFinite vertex-primitive and vertex-biprimitive 2-path-transitive graphs
This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.
متن کاملFinite Transitive Permutation Groups and Finite Vertex-Transitive Graphs
The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...
متن کاملM ar 2 00 7 A 27 - vertex graph that is vertex - transitive and edge - transitive but not l - transitive
I describe a 27-vertex graph that is vertex-transitive and edgetransitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms. A graph (undirected, without loops or multiple edges) is said to be vertextransitive if its automorphism group acts transitively on the set of vertices, edge-transitive if its automorphism group ac...
متن کاملVertex-to-vertex pursuit in a graph
A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one’s present vertex or moving to an adjacent vertex; each move is seen by both players. The cop wins if he manages to occupy the same vertex as the robber, and the rob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2012
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.11.004